Managing Simple Re-entrant Ow Lines I. Theoretical Foundation

نویسندگان

  • Carlos F. Bispo
  • Sridhar Tayur
چکیده

We address several aspects related to managing re-entrant lines in an uniied manner { capacity allocation, inventory management and production control { in a set of three papers. Our approach to study these systems is through simulation based optimization. Simulation ooers the exibility to model the complexities adequately while the gradient computation (via Innnitesimal Perturbation Analysis) helps identify good solutions quickly. In this rst paper, we concentrate on a very simple family of re-entrant systems as a rst step towards analyzing a broader family of production systems. Our framework is a discrete time capacitated multiple product production-inventory system operating under a base stock policy. We analyze several diierent production (Linear Scaling, Priority, Equalize Shortfall) and capacity allocation (No sharing, Partial sharing and Total sharing) rules. We develop expressions for and validate the appropriate IPA derivatives. These derivatives can then be used in an optimization tool which enables the determination of optimal parameters for the several policies proposed. In 6], we provide insights based on an extensive computational study using the results provided here. In 7], we show that our production rules and capacity allocation methods lead to stable systems under base stock policy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Managing Simple Re-entrant Ow Lines Ii. Experimental Study

This paper continues our study on the management of multi-product, capacitated re-entrant lines. Based on the theoretical framework developed in 2], we discuss some insights obtained by a simulation study. We are interested in understanding the performance of implementable capacity management schemes (No-sharing, Partial Sharing and Total Sharing) and production rules (Linear Scaling, Equalize ...

متن کامل

Managing Simple Re-entrant Ow Lines Theoretical Foundation and Experimental Results

We address several aspects related to managing re-entrant lines in a uni ed manner { capacity allocation, inventory management and production control. Our approach to study these systems is through simulation based optimization. Simulation o ers the exibility to model the complexities adequately while the gradient computation (via In nitesimal Perturbation Analysis) helps identify good solution...

متن کامل

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

متن کامل

A simple proof of diffusion approximations for LBFS re-entrant lines

For a re-entrant line operating under the last-buffer–first-serve service policy, there have been two independent proofs of a heavy traffic limit theorem. The key to these proofs is to prove the uniform convergence of a critical fluid model. We give a new proof for the uniform convergence of the fluid model.

متن کامل

Di usion Approximations for Re - Entrant Lines with aFirst - Bu er - First - Served Priority

The diiusion approximation is proved for a class of queueing networks, known as re-entrant lines, under a rst-buuer-rst-served (FBFS) service discipline. The diiusion limit for the workload process is a semi-martingale reeecting Brownian motion on a nonnegative orthant. This approximation has recently been used by Dai, Yeh and Zhou (1994) in estimating the performance measures of the re-entrant...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997